Search results for "Llenguatges de programació"

showing 3 items of 3 documents

A description based on languages of the final non-deterministic automaton

2014

The study of the behaviour of non-deterministic automata has traditionally focused on the languages which can be associated to the different states. Under this interpretation, the different branches that can be taken at every step are ignored. However, we can also take into account the different decisions which can be made at every state, that is, the branches that can be taken, and these decisions might change the possible future behaviour. In this case, the behaviour of the automata can be described with the help of the concept of bisimilarity. This is the kind of description that is usually obtained when the automata are regarded as labelled transition systems or coalgebras. Contrarily t…

Nested wordTheoretical computer scienceGeneral Computer ScienceTimed automatonLlenguatges de programacióω-automatonTheoretical Computer ScienceDeterministic pushdown automatonCoalgebraFinal automatonDeterministic automatonQuantum finite automataAutomatitzacióComputer Science::DatabasesMathematicsDiscrete mathematicsNonlinear Sciences::Cellular Automata and Lattice GasesNon-deterministic automatonMobile automatonBisimilarityComputer Science::Programming LanguagesAutomata theoryFormal languageÀlgebraMATEMATICA APLICADAComputer Science::Formal Languages and Automata Theory
researchProduct

Formations of Monoids, Congruences, and Formal Languages

2015

The main goal in this paper is to use a dual equivalence in automata theory started in [25] and developed in [3] to prove a general version of the Eilenberg-type theorem presented in [4]. Our principal results confirm the existence of a bijective correspondence between three concepts; formations of monoids, formations of languages and formations of congruences. The result does not require finiteness on monoids, nor regularity on languages nor finite index conditions on congruences. We relate our work to other results in the field and we include applications to non-r-disjunctive languages, Reiterman s equational description of pseudovarieties and varieties of monoids.

Pure mathematicsGeneral Computer ScienceApplied MathematicsData ScienceCWI Technical Report reportFormationsLlenguatges de programacióAbstract family of languagesCongruence relationlcsh:QA75.5-76.95Formal languagesMathematics::Category TheoryFormal languageComputingMethodologies_DOCUMENTANDTEXTPROCESSINGBijectionAutomata theorylcsh:Electronic computers. Computer scienceÀlgebraEquivalence (formal languages)SemigroupsMATEMATICA APLICADAAlgorithmAutomata theoryMathematicsScientific Annals of Computer Science
researchProduct

Magister : revista de formación del profesorado e investigación educativa

2018

Resumen tomado de la publicación En los últimos años movimientos relacionados con la robótica educativa, el movimiento maker o el movimiento STEM han potenciado la integración en las aulas de contenidos de matemáticas con otros propios de las ciencias de la computación. El uso de entornos tecnológicos en educación, así como el resurgimiento de la programación en la escuela son tendencia consolidada en el panorama educativo. En este estudio pretendemos explorar la capacidad de estudiantes de infantil y primaria para elaborar esbozos de programas a partir de su lenguaje propio así como explorar la conveniencia del uso de un lenguaje de programación simbólico para resolver un problema. Así, de…

investigación experimentalsolución de problemasProgramació (Ordinadors)lenguaje de programaciónrobóticaLlenguatges de programacióenseñanza primariaeducación preescolarinvestigación educativaSolució de problemesmatemáticas
researchProduct